A New Viewpoint for Mining Frequent Patterns

نویسندگان

  • Thanh-Trung Nguyen
  • Phi-Khu Nguyen
چکیده

According to the traditional viewpoint of Data mining, transactions are accumulated over a long period of time (in years) in order to find out the frequent patterns associated with a given threshold of support, and then they are applied to practice of business as important experience for the next business processes. From the point of view, many algorithms have been proposed to exploit frequent patterns. However, the huge number of transactions accumulated for a long time and having to handle all the transactions at once are still challenges for the existing algorithms. In addition, today, new characteristics of the business market and the regular changes of business database with too large frequency of added-deleted-altered operations are demanding a new algorithm mining frequent patterns to meet the above challenges. This article proposes a new perspective in the field of mining frequent patterns: accumulating frequent patterns along with a mathematical model and algorithms to solve existing challenges. Keywords—accumulating frequent patterns; data mining; frequent pattern; horizontal parallelization; representative set; vertical parallelization

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High Fuzzy Utility Based Frequent Patterns Mining Approach for Mobile Web Services Sequences

Nowadays high fuzzy utility based pattern mining is an emerging topic in data mining. It refers to discover all patterns having a high utility meeting a user-specified minimum high utility threshold. It comprises extracting patterns which are highly accessed in mobile web service sequences. Different from the traditional fuzzy approach, high fuzzy utility mining considers not only counts of mob...

متن کامل

Reducing Attributes in Rough Set Theory with the Viewpoint of Mining Frequent Patterns

The main objective of the Attribute Reduction problem in Rough Set Theory is to find and retain the set of attributes whose values vary most between objects in an Information System or Decision System. Besides, Mining Frequent Patterns aims finding items that the number of times they appear together in transactions exceeds a given threshold as much as possible. Therefore, the two problems have ...

متن کامل

A New Algorithm for High Average-utility Itemset Mining

High utility itemset mining (HUIM) is a new emerging field in data mining which has gained growing interest due to its various applications. The goal of this problem is to discover all itemsets whose utility exceeds minimum threshold. The basic HUIM problem does not consider length of itemsets in its utility measurement and utility values tend to become higher for itemsets containing more items...

متن کامل

Frequent query discovery: a unifying ILP approach to association rule mining

Discovery of frequent patterns has been studied in a variety of data mining (DM) settings. In its simplest form, known from association rule mining, the task is to nd all frequent itemsets, i.e., to list all combinations of items that are found in a suucient number of examples. A similar task in spirit, but at the opposite end of the complexity scale, is the Inductive Logic Programming (ILP) ap...

متن کامل

Mining Frequent Patterns in Uncertain and Relational Data Streams using the Landmark Windows

Todays, in many modern applications, we search for frequent and repeating patterns in the analyzed data sets. In this search, we look for patterns that frequently appear in data set and mark them as frequent patterns to enable users to make decisions based on these discoveries. Most algorithms presented in the context of data stream mining and frequent pattern detection, work either on uncertai...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013